Tractable Rational Map Cryptosystem
نویسندگان
چکیده
Abstract. We introduce a new public-key cryptosystem with tractable rational maps. As an application of abstract algebra and algebraic geometry to cryptography, TRMC (Tractable Rational Map Cryptosystem) has many superior properties including high complexity, easy implementation and very fast execution. We describe the principles and implementation of TRMC and analyze its properties. Also, we give a brief account of security analysis.
منابع مشابه
Revision of Tractable Rational Map Cryptosystem
We introduce a new public-key cryptosystem with tractable rational maps. As an application of abstract algebra and algebraic geometry to cryptography, TRMC (Tractable Rational Map Cryptosystem) has many superior properties including high complexity, easy implementation and very fast execution. We describe the principles and implementation of TRMC and analyze its properties. Also, we give a brie...
متن کاملTractable Rational Map Signature
Digital signature schemes are crucial for applications in electronic commerce. The effectiveness and security of a digital signature scheme rely on its underlying public key cryptosystem. Trapdoor functions are central to public key cryptosystems. However, the modular exponentiation for RSA or the discrete logarithms for ElGamal/DSA/ECC, as the choice of the trapdoor functions, are relatively s...
متن کاملCryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show combinatorial weaknesses of the cryptosystem, and introduce a variant of the XL resolution algorithm, the Linear Method, which is able to leverage these weaknesses to invert in short time the trapdoor one-way function defin...
متن کاملNote on Design Criteria for Rainbow-Type Multivariates
Problem MQ: Solve the system p1 = p2 = · · · = pm = 0, where each pi is a quadratic polynomial in x = (x1, . . . , xn) and coefficients and variables are in K = GF(q). Generic MQ is NP-hard [GJ79], and consensus pegs it as a difficult problem to solve even probabilistically. The trapdoor is built into the public map P by the knowledge of the maps S and T . The central map Q may contain paramete...
متن کاملFrontiers in complex dynamics
Rational maps on the Riemann sphere occupy a distinguished niche in the general theory of smooth dynamical systems. First, rational maps are complexanalytic, so a broad spectrum of techniques can contribute to their study (quasiconformal mappings, potential theory, algebraic geometry, etc.) The rational maps of a given degree form a finite dimensional manifold, so exploration of this parameter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004